منابع مشابه
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal speedup within a constant factor (for p ≤ n/(log n)c, where p is the number of processors, n is the “size” of the problem, and c is a constant). Ranade later simplified the analysis and obtained a better processor bound. ...
متن کاملNeural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree
In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...
متن کاملBranch and Bound: A Paradigm of Elastic Network Caching
Content delivery is an increasingly dominating functionality of the Internet, and continuously poses significant pressures on the networking infrastructure as well as content providers. As a general mechanism to improve efficiency, caching has been used in several approaches; e.g., CDNs, caching proxies, and Redundancy Elimination (RE). In this paper, we propose a new caching paradigm called Br...
متن کاملBranch and Bound for Regular Bayesian Network Structure Learing
We consider efficient Bayesian network structure learning (BNSL) based on scores using branch and bound. Thus far, as a BNSL score, the Bayesian Dirichlet equivalent uniform (BDeu) has been used most often, but it is recently proved that the BDeu does not choose the simplest model even when the likelihood is maximized whereas Jeffreys’ prior and MDL satisfy such regularity. Although the BDeu ha...
متن کاملParametric Branch and Bound
The paper describes a procedure for mixed integer programming that allows branches to be imposed 'by degrees', which can subsequently be revised or weeded out according to their relative influence. It is an adaptive approach in which the branch and bound tree can be maillipulated and rl'Structured. The approach also yields measures of the costs of imposing the branches that lead to integer solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00158-9